- multiple path communication
- 多路(径)通信
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.
Multiple endings — refer to a case in entertainment (usually video games) where the story could end in different ways, depending on the actions of the characters. Audience interactivity is usually an important factor in determining which ending to use. Usually,… … Wikipedia
Communication for sustainable social change and development — involves the use of variety of communication techniques to address inefficient systems, processes, or modes of production within a specific location that has not incurred major technological advances. Different mediums and approaches are used to… … Wikipedia
Multiple Independent Levels of Security — Multiple Independent Levels of Security/Safety (MILS) is a high assurance security architecture based on the concepts of separation[1] and controlled information flow; implemented by separation mechanisms that support both untrusted and… … Wikipedia
Path integral formulation — This article is about a formulation of quantum mechanics. For integrals along a path, also known as line or contour integrals, see line integral. The path integral formulation of quantum mechanics is a description of quantum theory which… … Wikipedia
Parallel communication — In telecommunication and computer science, parallel communication is a method of sending several data signals simultaneously over a communication link (comprising of several wired channels in parallel) at one time. It contrasts with serial… … Wikipedia
Types of fiction with multiple endings — Multiple endings refer to a case in entertainment (usually video games) where the story could end in different ways, described as an alternate ending. Contents 1 Literature 2 Theatre 3 Movies 4 Animation … Wikipedia
Code division multiple access — This article is about a channel access method. For the mobile phone technology referred to as CDMA, see IS 95 and CDMA2000. Multiplex techniques Circuit mode (constant bandwidth) TDM · FDM … Wikipedia
Open Shortest Path First — (OSPF) is an adaptive routing protocol for Internet Protocol (IP) networks. It uses a link state routing algorithm and falls into the group of interior routing protocols, operating within a single autonomous system (AS). It is defined as OSPF… … Wikipedia
Vehicular communication systems — are an emerging type of networks in which vehicles and roadside units are the communicating nodes; providing each other with information, such as safety warnings and traffic information. As a cooperative approach, vehicular communication systems… … Wikipedia
Power line communication — or power line carrier (PLC), also known as power line digital subscriber line (PDSL), mains communication, power line telecom (PLT), power line networking (PLN), or broadband over power lines (BPL) are systems for carrying data on a conductor… … Wikipedia
Shortest path problem — A graph with 6 vertices and 7 edges In graph theory, the shortest path problem is the problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized. An example is… … Wikipedia